Lehmer ’ s problem for polynomials with odd coefficients

نویسندگان

  • Peter Borwein
  • Edward Dobrowolski
  • Michael J. Mossinghoff
چکیده

We prove that if f(x) = ∑n−1 k=0 akx k is a polynomial with no cyclotomic factors whose coefficients satisfy ak ≡ 1 mod 2 for 0 ≤ k < n, then Mahler’s measure of f satisfies log M(f) ≥ log 5 4 ( 1 − 1 n ) . This resolves a problem of D. H. Lehmer [12] for the class of polynomials with odd coefficients. We also prove that if f has odd coefficients, degree n−1, and at least one noncyclotomic factor, then at least one root α of f satisfies |α| > 1 + log 3 2n , resolving a conjecture of Schinzel and Zassenhaus [21] for this class of polynomials. More generally, we solve the problems of Lehmer and Schinzel and Zassenhaus for the class of polynomials where each coefficient satisfies ak ≡ 1 mod m for a fixed integer m ≥ 2. We also characterize the polynomials that appear as the noncyclotomic part of a polynomial whose coefficients satisfy ak ≡ 1 mod p for each k, for a fixed prime p. Last, we prove that the smallest Pisot number whose minimal polynomial has odd coefficients is a limit point, from both sides, of Salem [19] numbers whose minimal polynomials have coefficients in {−1, 1}.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Operational matrices with respect to Hermite polynomials and their applications in solving linear differential equations with variable coefficients

In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...

متن کامل

Trajectory Planning Using High Order Polynomials under Acceleration Constraint

The trajectory planning, which is known as a movement from starting to end point by satisfying the constraints along the path is an essential part of robot motion planning. A common way to create trajectories is to deal with polynomials which have independent coefficients. This paper presents a trajectory formulation as well as a procedure to arrange the suitable trajectories for applications. ...

متن کامل

Families of irreducible polynomials of Gaussian periods and matrices of cyclotomic numbers

Given an odd prime p we show a way to construct large families of polynomials Pq(x) ∈ Q[x], q ∈ C, where C is a set of primes of the form q ≡ 1 mod p and Pq(x) is the irreducible polynomial of the Gaussian periods of degree p in Q(ζq). Examples of these families when p = 7 are worked in detail. We also show, given an integer n ≥ 2 and a prime q ≡ 1 mod 2n, how to represent by matrices the Gauss...

متن کامل

On the Lehmer Constant of Finite Cyclic Groups

Results of Lind on Lehmer’s problem include the value of the Lehmer constant of the finite cyclic group Z/nZ, for n ≤ 5 and all odd n. By complementary observations we determine the Lehmer constant of Z/nZ, for all n except for multiples of 420.

متن کامل

On a class of polynomials related to Barker sequences

For an odd integer n > 0, we introduce the class LPn of Laurent polynomials P (z) = (n+ 1) + n ∑ k=1 k odd ck(z k + z−k), with all coefficients ck equal to −1 or 1. Such polynomials arise in the study of Barker sequences of even length, i.e., integer sequences having minimal possible autocorrelations. We prove that polynomials P ∈ LPn have large Mahler measures, namely, M(P ) > (n + 1)/2. We co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007